A Library of Anti-unification Algorithms
نویسندگان
چکیده
Generalization problems arise in many branches of artificial intelligence: machine learning, analogical and case-based reasoning, cognitive modeling, knowledge discovery, etc. Anti-unification is a technique used often to solve generalization problems. In this paper we describe an open-source library of some newly developed anti-unification algorithms in various theories: for firstand second-order unranked terms, higher-order patterns, and nominal terms.
منابع مشابه
Sixth International Symposium on Symbolic Computation in Software Science
Generalization problems arise in many areas of software science: code clone detection, program reuse, partial evaluation, program synthesis, invariant generation, etc. Anti-unification is a technique used often to solve generalization problems. In this paper we describe an open-source library of some newly developed anti-unification algorithms in various theories: for firstand second-order unra...
متن کاملA Theory About First - Order Terms in ACL 2 ?
We describe the development in ACL2 of a library of results about first-order terms. In particular, we present the formalization of some of the main properties of the complete lattice of first-order terms with respect to the subsumption relation. As a by-product, verified executable implementations are obtained for some basic operations on first-order terms, including matching, renaming, unific...
متن کاملA Theory About First - Order Terms in ACL 2 ⋆
We describe the development in ACL2 of a library of results about first-order terms. In particular, we present the formalization of some of the main properties of the complete lattice of first-order terms with respect to the subsumption relation. As a by-product, verified executable implementations are obtained for some basic operations on first-order terms, including matching, renaming, unific...
متن کاملAnti-unification Algorithms and Their Applications in Program Analysis
A term t is called a template of terms t1 and t2 iff t1 = tη1 and t2 = tη2, for some substitutions η1 and η2. A template t of t1 and t2 is called the most specific iff for any template t′ of t1 and t2 there exists a substitution ξ such that t = t ′ξ. The anti-unification problem is that of computing the most specific template of two given terms. This problem is dual to the well-known unificatio...
متن کاملComparing Unification Algorithms in First-Order Theorem Proving
Unification is one of the key procedures in first-order theorem provers. Most first-order theorem provers use the Robinson unification algorithm. Although its complexity is in the worst case exponential, the algorithm is easy to implement and examples where it may show exponential behaviour are believed to be atypical. More sophisticated algorithms, such as the Martelli and Montanari algorithm,...
متن کامل